Minimazation of Binary Decision Diagrams Based on Exchanges of Variables
نویسندگان
چکیده
We ropose in this paper a new exact algorithm and gr aduay improvement methods of minimizing binary decision diagrams (BDD’s). In the exact minimization algorithm the o timum order is searched by the exchanges o! variabyes of BDD’s based on the framework of Friedman’s algorithm. The use of BDD representation of a given function and intermediate functions makes it possible to introduce pruning into our method, which drastically reduces the computation cost. We also pro ose a greedy method and a simulated annealin metEod based on exchanges of arbitrary two variades, and a greedy method based on exchanges of adjacent m variables for m = 3 and 4.
منابع مشابه
Reduction of the Number of Paths in Binary Decision Diagrams by Linear Transformation of Variables
The paper deals with the problem of counting and minimizing the number of paths in Binary Decision Diagrams. The suggested approach uses the linear transform of initial variables and is based on a newly introduced weighted autocorrelation function. It is shown that the total number of paths in BDD is the sum of values of a weighted autocorrelation function. The efficiency of the proposed techni...
متن کاملApproximate Algorithms for Minimization of Binary Decision Diagrams on the Basis of Linear Transformations of Variables
Algorithms for an approximate minimization of binary decision diagrams (BDD) on the basis of linear transformations of variables are proposed. The algorithms rely on the transformations of only adjacent variables and have a polynomial complexity relative to the size of the table that lists values of the function involved.
متن کاملBinary Decision Diagrams
A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table requires space Ω(2n) to represent. In this lecture we introduce a data structure called a binary decision diagram which gives a representation that is potentially much more compact. We furthermore show how binary decision diagrams can be used to decide satisfia...
متن کاملRestructuring of Arithmetic Circuits with Biconditional Binary Decision Diagrams
Biconditional Binary Decision Diagrams (BBDDs) are a novel class of canonical binary decision diagrams where the branching condition, and its associated logic expansion, is biconditional on two variables. In this demonstration, we use an efficient BBDD manipulation package as front-end to a commercial synthesis tool to restructure arithmetic operations in critical components of telecommunicatio...
متن کاملWord Level Symbolic Model Checking A New Approach for Verifying Arithmetic Circuits
The highly-publicized division error in the Pentium has emphasized the importance of formal verification of arithmetic operations. Symbolic model checking techniques based on binary decision diagrams (BDDs) have been successful in verifying control logic. However, lack of proper representation for functions that map boolean vectors into integers has prevented this technique from being used for ...
متن کامل